//
// Created by gyc on 2020/11/4.
//
#include "../../common.h"

class Solution {

public:
    TreeNode *invertTree(TreeNode *root) {

        stack<TreeNode *> st{};
        st.push(root);
        while (!st.empty()) {
            auto curr = st.top();
            if (curr) {
                
            } else {

            }
        }

        return root;
    }
};
